Evolution Complexity of the Elementary Cellular Automaton Rule 18
نویسندگان
چکیده
Cellular automata are classes of mathematical systems characterized by discreteness (in space, time, and state values), determinism, and local interaction. Using symbolic dynamical theory, we coarse-grain the temporal evolution orbits of cellular automata. By means of formal languages and automata theory, we study the evolution complexity of the elementary cellular automaton with local rule number 18 and prove that its width 1-evolution language is regular, but for every n " 2 its width n-evolution language is not context free but context sensitive.
منابع مشابه
Complexity of Evolution Languages of the Elementary Cellular Automaton of Rule 146
Symbolic dynamics of cellular automata is introduced by coarse-graining the temporal evolution orbits. Evolution languages are defined. By using the theory of formal languages and automata, the complexity of evolution languages of the elementary cellular automaton of rule 146 is studied and it is proved that its width 1-evolution language is regular, but for every n ≥ 2 its width n-evolution la...
متن کاملComplexity Analysis in Cyclic Tag System Emulated by Rule 110
It is known that elementary cellular automaton rule 110 is capable of supporting universal computation by emulating cyclic tag system. Since the whole information necessary to perform computation is stored in the configuration, it is reasonable to investigate the complexity of configuration for the analysis of computing process. In this research we employed Lempel-Ziv complexity as a measure of...
متن کاملSolving the Parity Problem with Rule 60 in Array Size of the Power of Two
In the parity problem, a given cellular automaton has to classify any initial configuration into two classes according to its parity. Elementary cellular automaton rule 60 can solve the parity problem in periodic boundary conditions with array size of the power of two. The spectral analysis of the configurations of rule 60 at each time step in the evolution reveals that spatial periodicity emer...
متن کاملParticle Structures in Elementary Cellular Automaton Rule 146
Stochastic particle-like persistent structures are found in the class 3 elementary cellular automaton rule number 146. These particles arise as boundaries separating regions with black cells occupying sites at spacetime points Hx, tL of constant parity x⊕ t. The particles execute random walks and annihilate in pairs, with particle density decaying with time in a power-law fashion. It is shown t...
متن کاملCellular Automata: Elementary Cellular Automata
Cellular automata (CA) are discrete dynamical systems consist of a regular finite grid of cell; each cell encapsulating an equal portion of the state, and arranged spatially in a regular fashion to form an n-dimensional lattice. A cellular automata is like computers, data represented by initial configurations which is processed by time evolution to produce output. This paper is an empirical stu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Complex Systems
دوره 13 شماره
صفحات -
تاریخ انتشار 2002